A kripke-kleene semantics for logic programs*

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical Kripke Models and the Intuitionistic Semantics of Logic Programs

Motivated by the problem of extending stable semantics (SS) and well-founded semantics (WFS) while avoiding their drawbacks, we propose a new simple and intuitive semantics for (normal) logic programs, called canonical Kripke model semantics. Our approach is based on formulating stability in an intuitionistic framework which helps us overcome several drawbacks. As a consequence, every normal pr...

متن کامل

Kripke semantics for provability logic GLP

A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic [9, 5, 8]. This system plays an important role in some recent applications of provability algebras in proof theory [2, 3]. However, an obstacle in the study of GLP is that it is incomplete w.r.t. any class ...

متن کامل

Quantificational Modal Logic with Sequential Kripke Semantics

We introduce quantificational modal operators as dynamic modalities with (extensions of) Henkin quantifiers as indices. The adoption of matrices of indices (with action identifiers, variables and/or quantified variables as entries) gives an expressive formalism which is here motivated with examples from the area of multi-agent systems. We study the formal properties of the resulting logic which...

متن کامل

A Kripke-Joyal Semantics for Noncommutative Logic in Quantales

A structural semantics is developed for a first-order logic, with infinite disjunctions and conjunctions, that is characterised algebraically by quantales. The model structures involved combine the “covering systems” approach of Kripke-Joyal intuitionistic semantics from topos theory with the ordered groupoid structures used to model various connectives in substructural logics. The latter are u...

متن کامل

Kripke-Style Semantics for Non-Commutative Monoidal t-Norm Logic

A t-norm is a binary operation on [0, 1] that is associative, commutative, with identity 1 and non-decreasing in both argument. The notion of t-norm is very important in the context of fuzzy logic, for it is used in modeling a general form of the propositional conjunction. The basic fuzzy logic (BL logic) was introduced by Hájek in [9,10] and it was inspired by a continuous t-norm and its resid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Logic Programming

سال: 1985

ISSN: 0743-1066

DOI: 10.1016/s0743-1066(85)80005-4